Questions de communication, 8 | 0000

A Technique for Decomposing Algorithms Which Use a Single Shared Variable

A general theorem is proved which shows how a system of contending asynchronous processes with a special auxiliary supervisor process can be simulated by a system of contending processes without such a supervisor, with only a small increase in the shared space needed for communication. Two applications are presented, synchronization algorithms with different fairness properties requiring N + c ...

Solving large FPT problems on coarse-grained parallel machines

Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the po...

This is a repository copy of Identification of depression in women during pregnancy and the early postnatal period using the Whooley questions and the Edinburgh Postnatal Depression Scale : protocol for the Born and Bred in Yorkshire: PeriNatal Depression

Article: Littlewood, Elizabeth orcid.org/0000-0002-4606-4590, Ali, Shehzad orcid.org/0000-0002-8042-3630, Ansell, Pat et al. (10 more authors) (2016) Identification of depression in women during pregnancy and the early postnatal period using the Whooley questions and the Edinburgh Postnatal Depression Scale : protocol for the Born and Bred in Yorkshire: PeriNatal Depression Diagnostic Accuracy ...

Probabilistic Counting Algorithms for Data Base Applications

Non-Deterministic Communication Complexity with Few Witnesses

We study non-deterministic communication protocols in which no input has too many witnesses. De ne nk(f) to be the minimum complexity of a non-deterministic protocol for the function f in which each input has at most k witnesses. We present two di erent lower bounds for nk(f). Our rst result shows that nk(f) is bounded below by (qc(f)=k) where c(f) is the deterministic complexity. Our second re...